Characterization of Strong Stability of Stationary Solutions of Nonlinear Programs with a Finite Number of Equality Constraints and an Abstract Convex Constraint

نویسنده

  • Toshihiro Matsumoto
چکیده

In this report we treat nonlinear programs Pro(f, h;K) having an objective function f , a finite number of equality constraints h(x) = (h1(x), · · · , hl(x)) = 0, and an abstract convex constraint x ∈ K with its convex set K. Our particular interest is an algebraic criterion for a locally isolated stationary solution to be strong stable, in the sense of Kojima, under a Linear Independence Constraint Qualification condition defined to those programs. First, we introduce a simple sufficient condition for semismoothness of the Euclidean projector ρ+K onto K. Semismoothness of the Euclidean projectors onto closed convex cones pointed at 0 follows directly from this sufficiency. Secondly, under the condition of semismoothness of ρ+K and what we call the regular boundary condition for K, we characterize strong stability of a locally isolated stationary solution x̄, with (x̄, λ̄) its associate stationary point, in terms of B-subderivative ∂Bψ(x̄, λ̄; f, h) of some appropriately defined map ψ(x, λ; f, h) for programs Pro(f, h;K). This result is a generalization of the theory that Kojima developed in his famous paper. Thirdly, we state an explicit formula for the Jacobian of the Euclidean projector onto any closed convex set satisfying the C stratification, and interpret the regular boundary condition in terms of principal curvatures of the stratum.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Algebraic Criterion for Strong Stability of Stationary Solutions of Nonlinear Programs with a Finite Number of Equality Constraints and an Abstract Convex Constraint

This paper addresses strong stability, in the sense of Kojima, of stationary solutions of nonlinear programs Pro with a finite number of equality constraints and one abstract convex constraint defined by the closed convex set K. It intends to extend results of our former paper that treated nonlinear programs Pro in a special case that K is the set of nonnegative symmetric matrices S+. Firstly, ...

متن کامل

Characterization of Properly Efficient Solutions for Convex Multiobjective Programming with Nondifferentiable vanishing constraints

This paper studies the convex multiobjective optimization problem with vanishing constraints‎. ‎We introduce a new constraint qualification for these problems‎, ‎and then a necessary optimality condition for properly efficient solutions is presented‎. ‎Finally by imposing some assumptions‎, ‎we show that our necessary condition is also sufficient for proper efficiency‎. ‎Our results are formula...

متن کامل

An efficient one-layer recurrent neural network for solving a class of nonsmooth optimization problems

Constrained optimization problems have a wide range of applications in science, economics, and engineering. In this paper, a neural network model is proposed to solve a class of nonsmooth constrained optimization problems with a nonsmooth convex objective function subject to nonlinear inequality and affine equality constraints. It is a one-layer non-penalty recurrent neural network based on the...

متن کامل

VOLUME MINIMIZATION WITH DISPLACEMENT CONSTRAINTS IN TOPOLOGY OPTIMIZATION OF CONTINUUM STRUCTURES

In this paper, a displacement-constrained volume-minimizing topology optimization model is present for two-dimensional continuum problems. The new model is a generalization of the displacement-constrained volume-minimizing model developed by Yi and Sui [1] in which the displacement is constrained in the loading point. In the original model the displacement constraint was formulated as an equali...

متن کامل

Optimal Design of Geometrically Nonlinear Structures Under a Stability Constraint

This paper suggests an optimization-based methodology for the design of minimum weight structures with kinematic nonlinear behavior. Attention is focused on three-dimensional reticulated structures idealized with beam elements under proportional static loadings. The algorithm used for optimization is based on a classical optimality criterion approach using an active-set strategy for extreme lim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006